home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Light ROM 4
/
Light ROM 4 - Disc 1.iso
/
text
/
maillist
/
1994
/
aug94.doc
/
000641_owner-lightwave-l _Tue Aug 30 00:56:15 1994.msg
< prev
next >
Wrap
Internet Message Format
|
1995-03-23
|
1KB
Return-Path: <owner-lightwave-l>
Received: by mail.netcom.com (8.6.9/Netcom) id AAA12515; Tue, 30 Aug 1994 00:20:35 -0700
Received: from zeus.datasrv.co.il by mail.netcom.com (8.6.9/Netcom) id AAA12478; Tue, 30 Aug 1994 00:20:22 -0700
Received: by zeus.datasrv.co.il id AA12814 (5.65c/IDA-1.4.4 for lightwave-l@netcom.com); Tue, 30 Aug 1994 09:20:38 +0200
Date: Tue, 30 Aug 1994 09:20:36 +0200 (IST)
From: ZAPA <zapa@zeus.datasrv.co.il>
Subject: Re: Triple Reverse
To: lightwave-l@netcom.com
In-Reply-To: <9408282358.aa03401@deepthought.armory.com>
Message-Id: <Pine.3.89.1.2.9408300929.A12235-0100000@zeus.datasrv.co.il>
Mime-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-lightwave-l@netcom.com
Precedence: bulk
Reply-To: lightwave-l@netcom.com
Thad :)
> Is their an easy way to convert a triangle based polygon to a multisided polygon?
> Like using the triple command in reverse?
Shift + 'z' (Z) Does this, but you have to select the polygons at first.
Pixel 3d Pro has a similar functions which operates on all the triangles,
trying to reduce them to multi-sided polygons. This is not a reliable
operation, though.
What we need is an algorithm that checks to see if there are connected
triangles that are parallel to each other, then combine them to one polygon.
Stuart, or any Arexx wiz?
Nir Hermoni, Israel
zapa@datasrv.co.il